The Complexity of Bottleneck Labeled Graph Problems
نویسندگان
چکیده
منابع مشابه
the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولComplexity of Graph Covering Problems
For a xed graph H, the H-cover problem asks whether an input graph G allows a degree preserving mapping f : V (G) ! V (H) such that for every v 2 V (G), f(N G (v)) = N H (f(v)). In this paper we design eecient algorithms for certain graph covering problems according to two basic techniques. The rst is based in part on a reduction to the 2-SAT problem. The second technique exploits necessary and...
متن کاملThe complexity of two graph orientation problems
We consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path lengths and the minimization of the diameter. We show that it is NP-complete to decide whether a graph has an orientation such that the sum of all the shortest paths lengths is at most an integer specified in the input. The proof is a short reduction from a result of Chvátal and Thomasse...
متن کاملThe graph bottleneck identity
A matrix S = (sij) ∈ R n×n is said to determine a transitional measure for a digraph Γ on n vertices if for all i, j, k ∈ {1, . . . , n}, the transition inequality sij sjk ≤ sik sjj holds and reduces to the equality (called the graph bottleneck identity) if and only if every path in Γ from i to k contains j. We show that every positive transitional measure produces a distance by means of a loga...
متن کاملLabeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation and analyze approximation algorithms, for both versions of the problem. For the maximization version we give a 1 2 -approximation algorithm based on local i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2008
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-008-9261-4